The Maximum Entropy on the Mean Method , Noise

In this paper we address the problem of building convenient criteria to solve linear and noisy inverse problems of the form y = Ax + n. Our approach is based on the speciication of constraints on the solution x through its belonging to a given convex set C. The solution is chosen as the mean of the distribution which is the closest to a reference measure on C with respect to the Kullback divergence, or cross-entropy. This is therefore called the Maximum Entropy on the Mean Method (memm). This problem is shown to be equivalent to the convex one x = arg min x F(x) submitted to y = Ax (in the noiseless case). Many classical criteria are found to be particular solutions with diierent reference measures. But except for some measures, these primal criteria have no explicit expression. Nevertheless, taking advantage of a dual formulation of the problem, the memm enables us to compute a solution in such cases. This indicates that such criteria could hardly have been derived without the memm. In order to integrate the presence of additive noise in the memm scheme, the object and noise are searched simultaneously for in an appropriate convex C 0. The memm then gives a criterion of the form x = arg min x F(x) + G(y ? Ax), where F and G are convex, without constraints. The functional G is related to the prior distribution of noise, and may be used to account for speciic noise distributions. Using the regularity of the criterion, the sensitivity of the solution to variations of the data is also derived.